Bin packing with fragmentable items: Presentation and approximations

We consider a variant of the Bin Packing Problem dealing with fragmentable items. Given a fixed number of bins, the objective is to put all the items into the bins by splitting them in a minimum number of fragments. This problem is useful for modeling splittable resource allocation. In this paper we introduce the problem and its complexity then we present a 6 5 -approximation algorithm for a special case in which all bins have the same capacities.